منابع مشابه
Languages and compatible relations on monoids ∗
With every monoid, one can associate various binary relations, in particular the so-called principal quasi-order, principal order and principal congruence. The aim of this paper is to show that any compatible quasiorder, order and congruence can be obtained as an intersection of the corresponding principal relations. The particular case of languages -subsets of free monoids generated by an alph...
متن کاملCounting the Relations Compatible with an Algebra
We investigate when a finite algebra admits only a finite number of compatible relations (modulo a natural equivalence). This finiteness condition is closely related to others in the literature, and arises naturally in duality theory. We find necessary conditions for a finite algebra to admit only finitely many compatible relations, as well as a family of examples of such algebras. The classic ...
متن کاملForcing Constructions and Countable Borel Equivalence Relations
We prove a number of results about countable Borel equivalence relations with forcing constructions and arguments. These results reveal hidden regularity properties of Borel complete sections on certain orbits. As consequences they imply the nonexistence of Borel complete sections with certain
متن کاملTwo common fixed Point theorems for compatible mappings
Recently, Zhang and Song [Q. Zhang, Y. Song, Fixed point theory forgeneralized $varphi$-weak contractions,Appl. Math. Lett. 22(2009) 75-78] proved a common fixed point theorem for two mapssatisfying generalized $varphi$-weak contractions. In this paper, we prove a common fixed point theorem fora family of compatible maps. In fact, a new generalization of Zhangand Song's theorem is given.
متن کاملLecture 11 – Two-level Constructions
For example, the case r = 2 corresponds to the construction R(2) = 1 SEQ(1) 2 SEQ(1 + 2) ∪ 2 SEQ(2) 1 SEQ(1 + 2) while the case r = 3 can be constructed as R(3) = 1 SEQ(1) 2 SEQ(1 + 2) 3 SEQ(1 + 2 + 3) ∪ 1 SEQ(1) 3 SEQ(1 + 3) 2 SEQ(1 + 2 + 3) ∪ 2 SEQ(2) 1 SEQ(1 + 2) 3 SEQ(1 + 2 + 3) ∪ 2 SEQ(2) 3 SEQ(2 + 3) 1 SEQ(1 + 2 + 3) ∪ 3 SEQ(2) 1 SEQ(1 + 3) 2 SEQ(1 + 2 + 3) ∪ 3 SEQ(2) 3 SEQ(2 + 3) 1 SEQ(1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 1978
ISSN: 0011-4642,1572-9141
DOI: 10.21136/cmj.1978.101549